#include "Binary Search Tree.h"
int main()
{
	BSTree<int,int> BS;
	BS.Insert(8,0);
	BS.Insert(7,0);
	BS.Insert(6,0);
	BS.Insert(5,0);
	BS.Insert(9,0);
	BS.Insert(10,0);
	BS.Insert(11,0);
	BS.Insert(12,0);
	BS.Insert(12,0);
	BS.InOrder();
	cout << endl;
	BSTreeNode<int, int>* b = BS.Find(7);
	cout << b->_key << endl;
	BS.Erase(6);
	BS.Erase(5);
	BS.Erase(7);
	BS.Erase(8);
	BS.Erase(9);
	BS.Erase(12);
	BS.Erase(11);
	BS.InOrder();
	cout << endl;
	testbstree();
	return 0;
}